Certificate-based Smooth Projective Hashing and Its Applications

نویسندگان

  • Sujuan Li
  • Yi Mu
  • Mingwu Zhang
چکیده

Smooth projective hashing was firstly introduced by Cramer and Shoup (EuroCrypt’02) as a tool to construct efficient chosen-ciphertext-secure public key encryption schemes. Since then, they have found many other applications, such as password-based authenticated key exchange, oblivious transfer, zero-knowledge arguments et al. Certificate-based encryption (CBE) not only eliminates third-party queries and heavy certificate management problem in traditional public-key encryption, but also solves key escrow problem for identity-based encryption. We introduce the new concept of certificate-based smooth projective hashing (CB-SPH). Under the security model for the leakage-resilient certificate-based encryption (LR-CBE), we show how to construct a general leakage-resilient certificate-based encryption scheme using the certificate-based smooth projective hashing. Based on these theoretical constructions, we present two concrete CB-SPH instantiations under the DBDH assumption and the DLWE assumption respectively. Based on these CB-SPH instantiations, we can construct leakage resilient CBE schemes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Smooth Projective Hashing and its Application to Two-Server PAKE

Smooth projective hash functions have been used as building block for various cryptographic applications, in particular for password-based authentication. In this work we propose the extended concept of distributed smooth projective hash functions where the computation of the hash value is distributed across n parties and show how to instantiate the underlying approach for languages consisting ...

متن کامل

Structure-Preserving Smooth Projective Hashing

Smooth projective hashing has proven to be an extremely useful primitive, in particular when used in conjunction with commitments to provide implicit decommitment. This has lead to applications proven secure in the UC framework, even in presence of an adversary which can do adaptive corruptions, like for example Password Authenticated Key Exchange (PAKE), and 1-out-of-m Oblivious Transfer (OT)....

متن کامل

Dual Projective Hashing and Its Applications - Lossy Trapdoor Functions and More

We introduce the notion of dual projective hashing. This is similar to Cramer-Shoup projective hashing, except that instead of smoothness, which stipulates that the output of the hash function looks random on NO instances, we require invertibility, which stipulates that the output of the hash function on NO instances uniquely determine the hashing key, and moreover, that there is a trapdoor whi...

متن کامل

Trapdoor Smooth Projective Hash Functions

Katz and Vaikuntanathan recently improved smooth projective hash functions in order to build oneround password-authenticated key exchange protocols (PAKE). To achieve security in the UC framework they allowed the simulator to extract the hashing key, which required simulation-sound non-interactive zero-knowledge proofs that are unfortunately ine cient. We improve the way the latter extractabili...

متن کامل

Smooth Projective Hashing for Conditionally Extractable Commitments

The notion of smooth projective hash functions was proposed by Cramer and Shoup and can be seen as special type of zero-knowledge proof system for a language. Though originally used as a means to build efficient chosen-ciphertext secure public-key encryption schemes, some variations of the Cramer-Shoup smooth projective hash functions also found applications in several other contexts, such as p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • I. J. Network Security

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2018